This is a combinatorial problem in canonical form . 這是組合論中的典型問題。
Inter - relations among collaborative discussion , meta - cognitive control and successful solution in combinatorial problem 合作討論和元認知監控與排列組合問題的解決
Adleman , l . m . " molecular computation of solutions to combinatorial problems . " science 266 ( 5187 ) ( 11 nov 1994 ) : 1021 - 4 組合問題的分子運算解決方法. " 。期刊科學第266卷。第1024到1024頁。
This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search 本文提出了將組合問題歸結為狀態空間搜索問題的數學模型和通用算法。
Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm , the present of the general searching algorithm is the apparent progress for the searching technology 因為組合問題的狀態空間表示比原來的搜索求解容易的多,通用搜索算法的提出是搜索技術的一個明顯的進步。
Supposed algorithm b is the concrete searching algorithm for the combinatorial problem p . the parameter of algorithm a corresponding to algorithm b is the algorithm that denotes the combinatorial problem p in the way of the state space 設b是求解組合問題p的具體搜索算法,算法a對應于算法b的參數就是用狀態空間表示組合問題p的算法。
The program of state space to solve one combinatorial problem is made up of the general searching module and one module of material problem . the different material problems have different modules , but the general searching module does not vary with the problems 一個組合問題的狀態空間求解程序由通用搜索模塊加上一個問題描述模塊組成,不同問題具有不同的問題描述模塊,通用搜索模塊不隨問題的改變而改變。
Problem c and problem d are also dual . they have a dual property that there are at least three " critical points " corresponding to an optimal straight - line in problem c and there are at least three " critical straight - lines " corre - sponding to an optimal point in problem d . from these properties , these four non - linear prob - lems could be transformed into combinatorial problems and could be solved by algorithms with polynomial - time iterations 問題c和問題d也是對偶問題。問題c和問題d也有很好的對偶性質:在問題c中,對應于一條最優直線,至少存在三個“臨界點” ;在問題d中,對應于一個最優點,至少存在三條“臨界直線” ?;谶@種性質,這四個非線性優化問題便轉化為組合問題,從而得到迭代次數為多項式的算法。
The algorithm is based on the breadth - first search and optimized by ant algorithm . ants system is an artificial system based on the behavior of real ant colonies , which is often used to solve combinatorial problems , such as traveling salesman problem ( tsp ) . in ant colony system ( acs ) , a set of cooperating agents called ants cooperate to find good solutions to tsp 本算法基于寬度優先并用螞蟻算法優化,螞蟻算法是一種基于真實蟻群的人工智能系統,常用于解決組合優化問題,如旅行商問題( tsp ) ,在螞蟻算法中一組螞蟻團結合作,尋找tsp問題的最優解。
Until now , this type of combinatorial problems are usually solved by linear programming , interger programming , analytical methods , heuristic methods and so on . but these methods have many disadvantages such as . low searching efficiency , converging slowly , converging to local optimization solution easily and not converging 本文針對目前對接入網優化存在著缺乏有效算法的現狀,確定了采用高效的啟發式搜索算法? ?遺傳算法作為優化算法,著重解決了遺傳算子的設計和實現問題,并對算法進行了改進,取得了很好的效果。